BRANCHING PROPERTIES FOR THE GROUPS G(de,e,r)
نویسنده
چکیده
We study general properties of the restriction of the representations of the finite complex reflection groupes G(de, e, r + 1) to their maximal parabolic subgroups of type G(de, e, r), and focus notably on the multiplicity of components. In combinatorial terms, this amounts to the following question : which symmetries arise or disappear when one changes (exactly) one pearl in a combinatorial necklace ? MSC 2000 : 20C99,20F55.
منابع مشابه
Computing Vertex PI Index of Tetrathiafulvalene Dendrimers
General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.
متن کاملRANDOM FUZZY SETS: A MATHEMATICAL TOOL TO DEVELOP STATISTICAL FUZZY DATA ANALYSIS
Data obtained in association with many real-life random experiments from different fields cannot be perfectly/exactly quantified.hspace{.1cm}Often the underlying imprecision can be suitably described in terms of fuzzy numbers/\values. For these random experiments, the scale of fuzzy numbers/values enables to capture more variability and subjectivity than that of categorical data, and more accur...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملشبیهسازی انسان؛ چالشی نو فراروی اخلاق و حقوق بشر
On entend par le terme «clonage humain» deux types de pratiques: le clonage reproductif et le clonage non – reproductif. Le premier, dont la fin est la reproduction, consiste a transférer le noyau d’une cellule dans un ovocyte énuclée afin d’obtenir un embryon humain génétiquement identique au donneur. Ici, l’embryon cultive...
متن کامل